Dominating set - PDFSEARCH.IO - Document Search Engine

Dominating set
Results: 145

#	Item
111	Directed Scale-Free Graphs B´ela Bollob´as∗ Christian Borgs† Abstract Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:20 Random graph Graph Dominating set Orbifold Graph theory Mathematics Theoretical computer science
112	arXiv:1101.5747v2 [math.CO] 1 Feb[removed]Rainbow connections of graphs – A survey∗ Xueliang Li, Yuefang Sun Center for Combinatorics and LPMC-TJKLC Nankai University, Tianjin[removed], P.R. China Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-02-01 20:03:34 NP-complete problems Graph Connectivity Tree Dominating set Edge coloring Degree K-edge-connected graph Neighbourhood Graph theory Mathematics Graph coloring
113	An O(log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model ∗ Christian Scheideler† Add to Reading List Source URL: www14.in.tum.de Language: English - Date: 2008-03-17 20:34:46 Wireless Telecommunications engineering Network topology Topology control Wireless ad-hoc network ANT Channel Wireless mesh network Topology Wireless networking Technology Wireless sensor network
114	The Fifteenth Annual Nebraska Conference for Undergraduate Women in Mathematics January 25 - January 27, 2013 Add to Reading List Source URL: www.math.unl.edu Language: English - Date: 2013-04-18 10:08:06 NP-complete problems Graph Dominating set Tree Graceful labeling Graph coloring Planar graphs Edge coloring Graph theory Theoretical computer science Mathematics
115	Analysis of a Greedy Heuristic For Finding Small Dominating Sets in Graphs (To appear in Information Processing Letters) Abhay K. Parekh Laboratory For Information and Decision Systems, M.I.T., Cambridge, MA 02139, USA Add to Reading List Source URL: www.tecknowbasic.com Language: English - Date: 2005-07-07 00:58:29 Combinatorics Dominating set Set cover problem Greedy algorithm Mathematics Theoretical computer science NP-complete problems
116	Compressed Encoding for Rank Modulation Eyal En Gad Anxiao (Andrew) Jiang Add to Reading List Source URL: www.paradise.caltech.edu Language: English - Date: 2011-03-11 17:48:36 Coding theory Unitary group Applied mathematics Network flow Linear algebra Random permutation statistics Mathematics Theoretical computer science Dominating set
117	Microsoft Word - Final-icml2012-Clustering to Maximize the Ratio of Split to Diameter.doc Add to Reading List Source URL: icml.cc Language: English - Date: 2012-06-07 13:19:48 NP-complete problems Graph Connectivity Clique Tree Planar separator theorem Dominating set Graph theory Mathematics Theoretical computer science
118	Parameterized Quantum Query Complexity of Graph Collision ? Andris Ambainis, Kaspars Balodis, J¯anis Iraids, Raitis Ozols, and Juris Smotrovs arXiv:1305.1021v1 [quant-ph] 5 May 2013 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-05-06 20:20:50 Tree Minor Graph Connectivity Path decomposition Dominating set Graph theory Tree decomposition NP-complete problems
119	Program for MDS Status Workshop, 2012. Friday[removed]:30 – 17:05 Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces Max Klimm Add to Reading List Source URL: www3.math.tu-berlin.de Language: English NP-complete problems Matroid theory Graph operations Tree decomposition Matroid Minor Vertex cover Graph Dominating set Graph theory Mathematics Theoretical computer science
120	Chapter 2: Greedy Algorithms and Local Search (cp. Williamson & Shmoys, Chapter 2) 16 Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 NP-complete problems Operations research Mathematical optimization Complexity classes Travelling salesman problem Job shop scheduling Dominating set Greedy algorithm Algorithm Theoretical computer science Computational complexity theory Applied mathematics